Plan Merging & Plan Reuse as Satisfiability
نویسنده
چکیده
Planning as satissability has hitherto focused only on purely generative planning. There is an evidence in traditional reenement planning that planning incrementally by reusing or merging plans can be more eecient than planning from scratch (sometimes reuse is not eecient, but becomes necessary if the cost of abandoning the reusable plan is too high, when users are charged for the planning solution provided). We adapt the satissability paradigm to these scenarios by providing a framework where reusable or mergeable plans can be either contiguous or partially ordered and their actions can be removed and new actions can be added. We report the asymptotic sizes of the propositional encodings for several cases of plan reuse and plan merging. Our empirical evaluation shows that the satissability paradigm can scale up to handle plan reuse and plan merging.
منابع مشابه
Case-Based Merging Techniques in OAKPLAN
Case-based planning can take advantage of former problem-solving experiences by storing in a plan library previously generated plans that can be reused to solve similar planning problems in the future. Although comparative worst-case complexity analyses of plan generation and reuse techniques reveal that it is not possible to achieve provable efficiency gain of reuse over generation, we show th...
متن کاملMerge Strategies for Multiple Case Plan Replay
Planning by analogical reasoning is a learning method that consists of the storage, retrieval, and replay of planning episodes. Planning performance improves with the accumulation and reuse of a library of planning cases.Retrieval is driven by domain-dependent similarity metrics based on planning goals and scenarios. In complex situations with multiple goals, retrieval may find multiple past pl...
متن کاملCO-PLAN: Combining SAT-Based Planning with Forward-Search
This extended-abstract introduces CO-PLAN, a two-phase propositional planning system for the cost-optimal case. During the first phase, CO-PLAN constructs the n-step plangraph for increasing values of n, passing the corresponding decision problem at each stage to a modified Boolean satisfiability procedure. This procedure determines whether an nstep plan exists, and if so identifies a plan that...
متن کاملPlan Reuse Versus Plan Generation: A Theoretical and Empirical Analysis
The ability of a planner to reuse parts of old plans is hypothesized to be a valuable tool for improving eeciency of planning by avoiding the repetition of the same planning eeort. We test this hypothesis from an analytical and empirical point of view. A comparative worst-case complexity analysis of generation and reuse under diierent assumptions reveals that it is not possible to achieve a pro...
متن کاملPlan Reuse versus Plan Generation :
The ability of a planner to reuse parts of old plans is hypothesized to be a valuable tool for improving eeciency of planning by avoiding the repetition of the same planning eeort. We test this hypothesis from an analytical and empirical point of view. A comparative worst-case complexity analysis of generation and reuse under diierent assumptions reveals that it is not possible to achieve a pro...
متن کامل